Initial Algebra and Final Coalgebra Semantics
نویسندگان
چکیده
The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others dual, and some conditions are given under which they coincide. More precisely, it is shown how to derive initial semantics from final semantics, using the initiality and finality to ensure their equality. Moreover, many facts about congruences (on algebras) and (generalized) bisimulations (on coalgebras) are shown to be dual as well.
منابع مشابه
A Coalgebraic Theory of Reactive Systems
In this report we study the connection between two well known models for interactive systems. Reactive Systems à la Leifer and Milner allow to derive an interactive semantics from a reduction semantics guaranteeing, under rather restrictive conditions, the compositionality of the abstract semantics (bisimilarity). Universal Coalgebra provides a categorical framework where bisimilarity can be ch...
متن کاملInitial Algebra and Final Coalgebra Semantics for Concurrency
The aim of this paper is to relate initial algebra semantics and nal coalgebra semantics It is shown how these two approaches to the semantics of programming languages are each others dual and some conditions are given under which they coincide More precisely it is shown how to derive initial semantics from nal semantics using the initiality and nality to ensure their equality Moreover many fac...
متن کاملCoalgebraic semantics for logic programs
General logic programs with negation have the 3-valued minimal Herbrand models based on the Kripke’s fixpoint knowledge revision operator and on Clark’s completion. Based on these results we deifine a new algebra , (with the relational algebra embedded in it), and present an algorithmic transformation of logic programs into the system of tuple-variable equations which is a -coalgebra. The solut...
متن کاملSequoidal Categories and Transfinite Games: A Coalgebraic Approach to Stateful Objects in Game Semantics
The non-commutative sequoid operator on games was introduced to capture algebraically the presence of state in history-sensitive strategies in game semantics, by imposing a causality relation on the tensor product of games. Coalgebras for the functor A — i.e., morphisms from S to A S — may be viewed as state transformers: if A has a final coalgebra, !A, then the anamorphism of such a state tran...
متن کاملTrace Semantics via Determinization
This paper takes a fresh look at the topic of trace semantics in the theory of coalgebras. The first development of coalgebraic trace semantics used final coalgebras in Kleisli categories, stemming from an initial algebra in the underlying category. This approach requires some non-trivial assumptions, like dcpo enrichment, which do not always hold, even in cases where one can reasonably speak o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005